Permutation Groups Generated by Binomials
نویسنده
چکیده
Let G(q) be the group of permutations of Fq generated by those permutations which can be represented as c 7→ ac + bc with a, b ∈ Fq and 0 < m < n < q. We show that there are infinitely many q for which G(q) is the group of all permutations of Fq . This resolves a conjecture of Vasilyev and Rybalkin.
منابع مشابه
New classes of permutation binomials and permutation trinomials over finite fields
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinational design, communication theory and so on. Permutation binomials and trinomials attract people’s interest due to their simple algebraic form and additional extraordinary properties. In t...
متن کاملThe Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes
We give a characterization of permutation polynomials over a finite field based on their coefficients, similar to Hermite’s Criterion. Then, we use this result to obtain a formula for the total number of monic permutation binomials of degree less than 4p over F4p+1, where p and 4p + 1 are primes, in terms of the numbers of three special types of permutation binomials. We also briefly discuss th...
متن کاملA Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from R\'{e}dei Functions
In this paper, we construct two classes of permutation polynomials over Fq2 with odd characteristic from rational Rédei functions. A complete characterization of their compositional inverses is also given. These permutation polynomials can be generated recursively. As a consequence, we can generate recursively permutation polynomials with arbitrary number of terms. More importantly, the conditi...
متن کاملA Generalized Lucas Sequence and Permutation Binomials
Let p be an odd prime and q = pm. Let l be an odd positive integer. Let p ≡ −1 (mod l) or p ≡ 1 (mod l) and l | m. By employing the integer sequence an = l−1 2 ∑ t=1 ( 2 cos π(2t− 1) l )n , which can be considered as a generalized Lucas sequence, we construct all the permutation binomials P (x) = xr + xu of the finite field Fq .
متن کاملPermutation Binomials over Finite Fields
We prove that if xm + axn permutes the prime field Fp, where m > n > 0 and a ∈ Fp, then gcd(m − n, p − 1) > √ p − 1. Conversely, we prove that if q ≥ 4 and m > n > 0 are fixed and satisfy gcd(m − n, q − 1) > 2q(log log q)/ log q, then there exist permutation binomials over Fq of the form xm + axn if and only if gcd(m,n, q − 1) = 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013